Nuprl Lemma : bezout_ident 11,40

a,b:u,v:. gcd_p(ab; ((u * a) + (v * b))) 
latex


Definitionst  T, x:AB(x), , True, T, prop{i:l}, x:AB(x), P  Q, decidable(P), False, P  Q, A  B, A
Lemmasdecidable le, le wf, bezout ident n, true wf, squash wf, gcd p wf, gcd p neg arg

origin